#include"AVLTree.h"
void test()
{

	AVLTree<int, int> brt;
	set<int> se;

	vector<int> v = { 2, 1, 3, 9, 6, 0, 5, 8, 4, 16, 7, 11, 26, 18, 14, 15 };
	//for (int i = 0; i < 10000; i++)
	//{
	//	int b = rand() % 1000 + i;
	//	auto ret = se.insert(b);
	//	if (ret.second)
	//	{
	//		v.push_back(b);
	//		brt.Insert(b, b);
	//	}

	for (auto& e : v)
	{
		if (e == 6)
		{
			int a = 1;
		}
		brt.Insert(e, e);
	}


	AVLTree<int, int> a1 = brt;

	AVLTree<int, int> a2(a1);

	a1.InOrder();
	cout << endl;
	a2.InOrder();


	//cout << "Is balance:" << brt.IsBalance() << endl;
}
int main()
{
	//TestBSTree3();
	//TestBSTree4();
	test();
	return 0;
}